Minimization problems with lack of compactness
نویسندگان
چکیده
منابع مشابه
4 F eb 2 00 5 Singular elliptic problems with lack of compactness
We consider the following nonlinear singular elliptic equation −div (|x| −2a ∇u) = K(x)|x| −bp |u| p−2 u + λg(x) in R N , where g belongs to an appropriate weighted Sobolev space, and p denotes the Caffarelli–Kohn– Nirenberg critical exponent associated to a, b, and N. Under some natural assumptions on the positive potential K(x) we establish the existence of some λ 0 > 0 such that the above pr...
متن کاملOn Non-local Variational Problems with Lack of Compactness Related to Non-linear Optics
We give a simple proof of existence of solutions of the dispersion management and diffraction management equations for zero average dispersion, respectively diffraction. These solutions are found as maximizers of non-linear and non-local variational problems which are invariant under a large non-compact group. Our proof of existence of maximizer is rather direct and avoids the use of Lions’ con...
متن کاملLack of Compactness in Two-Scale Convergence
This article deals with the links between compensated compactness and two-scale convergence. More precisely, we ask the following question: Is the div-curl compactness assumption sufficient to pass to the limit in a product of two sequences which two-scale converge with respect to the pair of variables (x, x/ε)? We reply in the negative. Indeed, the div-curl assumption allows us to control osci...
متن کاملOn the duality of quadratic minimization problems using pseudo inverses
In this paper we consider the minimization of a positive semidefinite quadratic form, having a singular corresponding matrix $H$. We state the dual formulation of the original problem and treat both problems only using the vectors $x in mathcal{N}(H)^perp$ instead of the classical approach of convex optimization techniques such as the null space method. Given this approach and based on t...
متن کاملConvex minimization problems with weak constraint qualifications
One revisits the standard saddle-point method based on conjugate duality for solving convex minimization problems. Our aim is to reduce or remove unnecessary topological restrictions on the constraint set. Dual equalities and characterizations of the minimizers are obtained with weak or without constraint qualifications. The main idea is to work with intrinsic topologies which reflect some geom...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Banach Center Publications
سال: 1996
ISSN: 0137-6934,1730-6299
DOI: 10.4064/-35-1-97-107